An Hnn-extension with Cyclic Associated Subgroups and with Unsolvable Conjugacy Problem
نویسندگان
چکیده
In this paper, we consider the conjugacy problem for HNNextensions of groups with solvable conjugacy problem for which the associated subgroups are cyclic. An example of such a group with unsolvable conjugacy problem is constructed. A similar construction is given for free products with amalgamation.
منابع مشابه
Divisibility Theory and Complexity of Algorithms for Free Partially Commutative Groups
3.3. The greatest common divisor and the least common multiple 12 3.4. Parabolic divisors 14 3.5. Divisibility: further properties 14 4. Normal forms arising from HNN extensions 16 4.1. HNN -normal form 16 5. Conjugacy problem 18 5.1. Conjugacy Criterion for HNN -extensions 18 5.2. Block decomposition 22 5.3. Conjugacy with respect to a subgroup 23 5.4. An algorithm for solving the Conjugacy Pr...
متن کاملFinitely Presented Extensions by Free Groups
We prove here that a finitely presented group with a free quotient of rank n is an HNN-extension with n stable letters of a finitely generated group where the associated subgroups are finitely generated. This theorem has a number of consequences. In particular, in the event that the free quotient is cyclic it reduces to an elementary and quick proof of a theorem of Bieri and Strebel. 1. Finitel...
متن کاملThe Conjugacy Problem for Graph Products with Cyclic Edge Groups
A graph product is the fundamental group of a graph of groups Amongst the simplest examples are HNN groups and free products with amalgamation. The conjugacy problem is solvable for recursively presented graph products with cyclic edge groups over finite graphs if the vertex groups have solvable conjugacy problem and the sets of cyclic generators in them are semicritical. For graph products ove...
متن کاملSubgroup Separability and Conjugacy Separability of Certain HNN Extensions
In this note, we give characterizations for certain HNN extensions of polycyclic-by-finite groups with central associated subgroups to be subgroup separable and conjugacy separable. We shall do this by showing the equivalence of subgroup separability and conjugacy separability in this type of HNN extensions. 2000 Mathematics Subject Classification: Primary 20E06, 20E26; Secondary 20F10, 20F19
متن کاملThe Word Problem and Related Results for Graph Product Groups
A graph product is the fundamental group of a graph of groups. Amongst the simplest examples are HNN groups and free products with amalgamation. The torsion and conjugacy theorems are proved for any group presented as a graph product. The graphs over which some graph product has a solvable word problem are characterised. Conditions are then given for the solvability of the word and order proble...
متن کامل